The degree structure of Weihrauch-reducibility
نویسندگان
چکیده
We answer a question [2] by Vasco Brattka and Guido Gherardi by proving that the Weihrauch lattice is not a Brouwer algebra. The computable Weihrauch lattice is also not a Heyting algebra, but the continuous Weihrauch lattice is. We further investigate embeddings of the Medvedev degrees into the Weihrauch degrees.
منابع مشابه
Game characterizations of function classes and Weihrauch degrees
Games are an important tool in mathematics and logic, providing a clear and intuitive understanding of the notions they define or characterize. In particular, since the seminal work of Wadge in the 1970s, game characterizations of classes of functions in Baire space have been a rich area of research, having had significant and far-reaching development by van Wesep, Andretta, Duparc, Motto Ros, ...
متن کاملEffective Choice and Boundedness Principles in Computable Analysis
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or compu...
متن کاملWeihrauch Degrees, Omniscience Principles and Weak Computability
In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions on represented spaces. We call the corresponding equivalence classes Weihrauch degrees and we show that the corresponding partial order induces a lower semi-lattice with the disjoint union of multi-valued functions as greatest ...
متن کاملUniversality, optimality, and randomness deficiency
A Martin-Löf test U is universal if it captures all non-Martin-Löf random sequences, and it is optimal if for every ML-test V there is a c ∈ ω such that ∀n(Vn+c ⊆ Un). We study the computational differences between universal and optimal ML-tests as well as the effects that these differences have on both the notion of layerwise computability and the Weihrauch degree of LAY, the function that pro...
متن کاملMeasuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis
This report documents the program and the outcomes of Dagstuhl Seminar 15392 “Measuring the Complexity of Computational Content: Weihrauch Reducibility and Reverse Analysis.” It includes abstracts on most talks presented during the seminar, a list of open problems that were discussed and partially solved during the meeting as well as a bibliography on the seminar topic that we compiled during t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logical Methods in Computer Science
دوره 9 شماره
صفحات -
تاریخ انتشار 2010